Modelling Concurrency with Quotient Monoids
نویسندگان
چکیده
Four quotient monoids over step sequences and one with compound generators are introduced and discussed. They all can be regarded as extensions (of various degrees) of Mazurkiewicz traces [14] and comtraces of [10].
منابع مشابه
Efficient Solution to Some Problems in Free Partially Commutative Monoids
In theoretical computer science, and, in particular, in automata and formal language theory, questions arise concerning words and sets of words in free monoids. Results and techniques from the study of the combinatorial algebra of the free monoid have provided an “algebraic” basis for dealing with many of these questions. In recent years there has been increasing interest in properties of words...
متن کاملBg = Pg: a Success Story
All semigroups and monoids except free monoids and free groups are assumed finite in this paper. A monoid M divides a monoid N if M is a quotient of a submonoid of N . The set of idempotents of a monoid M is denoted E(M). The word “variety” will be used for pseudo-variety — that is, a collection of finite monoids closed under division and finite direct product. A block group is a monoid such th...
متن کاملMöbius inversion formula for monoids with zero
The Möbius inversion formula, introduced during the 19th century in number theory, was generalized to a wide class of monoids called locally finite such as the free partially commutative, plactic and hypoplactic monoids for instance. In this contribution are developed and used some topological and algebraic notions for monoids with zero, similar to ordinary objects such as the (total) algebra o...
متن کاملTwo Recognizable String-Matching Problems Over Free Partially Commutative Monoids
Let C be a finite alphabet, and C* the free monoid generated by Z. Let x, y E C* and x = uyv for U, v E C*. Then y is a factor of x. Moreover if u = 1, then y is a prefix of x, and if u = 1, then y is a suffix of x. Here 2. is the null word. One of the typical string matching problems over C* is the following: given a text string XEX* and a pattern string VEC*, decide whether or not y is a fact...
متن کاملModels for Quantitative Distributed Systems and Multi-Valued Logics
We investigate weighted asynchronous cellular automata with weights in valuation monoids. These automata form a distributed extension of weighted finite automata and allow us to model concurrency. Valuation monoids are abstract weight structures that include semirings and (non-distributive) bounded lattices but also offer the possibility to model average behaviors. We prove that weighted asynch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008